A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network
نویسندگان
چکیده
منابع مشابه
Consistent Neighbourhood in a Tabu Search
We present a general approach for solving Constraint Optimization Problems. A Tabu Search is performed on a well-designed Consistent Neighbourhood built using Constraint Programming. After each variable assignment, the conflicting variables are deleted to maintain the consistency of the instantiated constraints. Hence, instead of allowing infeasible moves on complete configurations, it works on...
متن کاملVariable neighbourhood search based heuristic for K-harmonic means clustering
Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cannot be addressed by computers at their present speed. In such cases, the heuristic approach can be...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملHeuristic Concentration and Tabu Search: A Nose to Nose Comparison
In 1997 two papers applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) to the p-median problem were published in consecutive volumes of the European Journal of Operational Research. Here we apply the method of HC some of the data sets which were used for computational experience in the paper on TS and briefly set out the
متن کاملReactive Tabu Search and Variable Neighbourhood Descent Applied to the Vehicle Routing Problem with Backhauls
We are in the presence of the VRP with backhauls, also known as the linehaul-backhaul problem, when the vehicles are not only required to deliver goods to customers, but also to pick up goods at customers locations. An example of this partition of the set of customers could be the grocery industry. The supermarkets and shops are the linehaul customers and the grocery suppliers are the backhaul ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Reliability Engineering & System Safety
سال: 2016
ISSN: 0951-8320
DOI: 10.1016/j.ress.2015.08.008